Towards Efficient and Scalable Speech Compression Schemes for Robust Speech Recognition Applications
نویسندگان
چکیده
منابع مشابه
Improving the performance of MFCC for Persian robust speech recognition
The Mel Frequency cepstral coefficients are the most widely used feature in speech recognition but they are very sensitive to noise. In this paper to achieve a satisfactorily performance in Automatic Speech Recognition (ASR) applications we introduce a noise robust new set of MFCC vector estimated through following steps. First, spectral mean normalization is a pre-processing which applies to t...
متن کاملIntelligent scalable image watermarking robust against progressive DWT-based compression using genetic algorithms
Image watermarking refers to the process of embedding an authentication message, called watermark, into the host image to uniquely identify the ownership. In this paper a novel, intelligent, scalable, robust wavelet-based watermarking approach is proposed. The proposed approach employs a genetic algorithm to find nearly optimal positions to insert watermark. The embedding positions coded as chr...
متن کاملLow Delay Scalable Decomposition of Speech Waveforms
Decomposition of speech signals into periodic and noise components is widely used in speech coding to facilitate efficient compression. Existing decomposition schemes are either too inflexible to model transient changes in the speech signal and require large delay or alternatively produce a large set of parameters that is not scalable to low rate applications. This paper proposes a scheme that ...
متن کاملAn Information-Theoretic Discussion of Convolutional Bottleneck Features for Robust Speech Recognition
Convolutional Neural Networks (CNNs) have been shown their performance in speech recognition systems for extracting features, and also acoustic modeling. In addition, CNNs have been used for robust speech recognition and competitive results have been reported. Convolutive Bottleneck Network (CBN) is a kind of CNNs which has a bottleneck layer among its fully connected layers. The bottleneck fea...
متن کاملRobust feature vector compression algorithm for distributed speech recognition
In this paper we propose an algorithm for efficient compression of feature extracted parameters used in speech recognition. The algorithm provides a compression ratio of roughly 1:10 and causes negligible or no loss in recognition performance. It is also shown to be robust against enviromental noise. Combined with an appropriate framing structure, a complete system is obtained, which can be use...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000